L1-Optimal Splines for Outlier Rejection

نویسندگان

  • Masaaki Nagahara
  • Clyde F. Martin
چکیده

In this article, we consider control theoretic splines with L optimization for rejecting outliers in data. Control theoretic splines are either interpolating or smoothing splines, depending on a cost function with a constraint defined by linear differential equations. Control theoretic splines are effective for Gaussian noise in data since the estimation is based on L optimization. However, in practice, there may be outliers in data, which may occur with vanishingly small probability under the Gaussian assumption of noise, to which L-optimized spline regression may be very sensitive. To achieve robustness against outliers, we propose to use L optimality, which is also used in support vector regression. A numerical example shows the effectiveness of the proposed method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

L-Optimal Splines for Outlier Rejection∗

In this article, we consider control theoretic splines with L optimization for rejecting outliers in data. Control theoretic splines are either interpolating or smoothing splines, depending on a cost function with a constraint defined by linear differential equations. Control theoretic splines are effective for Gaussian noise in data since the estimation is based on L optimization. However, in ...

متن کامل

Pii: S0167-8396(02)00087-0

We investigate C1-smooth univariate curvature-based cubic L1 interpolating splines in Cartesian and polar coordinates. The coefficients of these splines are calculated by minimizing the L1 norm of curvature. We compare these curvature-based cubic L1 splines with second-derivative-based cubic L1 splines and with cubic L2 splines based on the L2 norm of curvature and of the second derivative. In ...

متن کامل

Outlier Removal Power of the L1-Norm Super-Resolution

Super-resolution combines several low resolution images having different sampling into a high resolution image. L1-norm data fit minimization has been proposed to solve this problem in a robust way. The outlier rejection capability of this methods has been shown experimentally for super-resolution. However, existing approaches add a regularization term to perform the minimization while it may n...

متن کامل

A pure L1L1-norm principal component analysis

The L1 norm has been applied in numerous variations of principal component analysis (PCA). L1-norm PCA is an attractive alternative to traditional L2-based PCA because it can impart robustness in the presence of outliers and is indicated for models where standard Gaussian assumptions about the noise may not apply. Of all the previously-proposed PCA schemes that recast PCA as an optimization pro...

متن کامل

Computationally Efficient Models of Urban and Natural Terrain by Non-iterative Domain Decomposition for L1 Smoothing Splines

In this paper, we propose and validate a computationally efficient non-iterative domain decomposition procedure for calculating bivariate cubic L1 smoothing splines. This domain decomposition procedure involves calculating local L1 smoothing splines individually on overlapping “extended subdomains” that cover the global domain and then creating the global L1 smoothing spline by patching togethe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1308.0384  شماره 

صفحات  -

تاریخ انتشار 2013